Hybrid Genetic-Simulated Annealing Approach for Fractal Image Compression
نویسندگان
چکیده
In this paper a hybrid technique of Genetic Algorithm and Simulated Annealing (HGASA) is applied for Fractal Image Compression (FIC). With the help of this hybrid evolutionary algorithm effort is made to reduce the search complexity of matching between range block and domain block. The concept of Simulated Annealing (SA) is incorporated into Genetic Algorithm (GA) in order to avoid pre-mature convergence of the strings. One of the image compression techniques in the spatial domain is Fractal Image Compression but the main drawback of FIC is that it involves more computational time due to global search. In order to improve the computational time along with acceptable quality of the decoded image, HGASA technique has been proposed. Experimental results show that the proposed HGASA is a better method than GA in terms of PSNR for Fractal image Compression. Keywords—Fractal Image Compression, Genetic Algorithm, HGASA, Simulated Annealing.
منابع مشابه
Iteration Free Fractal Image Compression For Color Images Using Vector Quantization, Genetic Algorithm And Simulated Annealing
This research paper on iteration free fractal image compression for color images using the techniques Vector Quantization, Genetic Algorithm and Simulated Annealing is proposed, for lossy compression, to improve the decoded image quality, compression ratio and reduction in coding time. Fractal coding consists of the representation of image blocks through the contractive transformation coefficie...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملMassively parallel processing approach to fractal image compression with near-optimal coefficient quantization
In recent years Image Fractal Compression techniques (IFS) have gained more interest because of their capability to achieve high compression ratios while maintaining very good quality of the reconstructed image. The main drawback of such techniques is the very high computing time needed to determine the compressed code. In this work, after a brief description of IFS theory, we introduce the coe...
متن کاملFractal Image Compression
Standard graphics systems encode pictures by assigning an address and colour attribute for each point of the object resulting in a long list of addresses and attributes. Fractal geometry enables a newer class of geometrical shapes to be used to encode whole objects, thus image compression is achieved. Compression ratios of 10,000:1 have been claimed by researchers in this field. The fractal equ...
متن کاملGenetic Algorithms for Codebook Generation in Vector Quantization
In the present paper we study genetic algorithms for the codebook generation problem of vector quantization. There are two different approaches to the problem: a codebook-based and a partition-based. Both these approaches can be derived from the optimality criteria of GLA. From these, the codebookbased approach is clearly superior to the partition-based approach. The experiments show that a pur...
متن کامل